Search results

1 – 3 of 3
Article
Publication date: 1 July 1989

Timothy D. Fry and Patrick R. Philipoom

In job‐shop scheduling research, the shortest processing timedespatching rule (SPT) has received considerable attention. Severaltruncated shortest processing time (SPT…

Abstract

In job‐shop scheduling research, the shortest processing time despatching rule (SPT) has received considerable attention. Several truncated shortest processing time (SPT) despatching rules have been published in the literature. The motivation for such rules is that SPT despatching will frequently result in favourable inventory levels but unfavourable due date performance. Thus, the truncated SPT rules periodically switch from SPT despatching to despatching by some other rule. Owing to the complexity associated with these truncated rules, their implementation is doubtful. As a result, a modified truncated rule is presented that is easy to implement and yet performs favourably with respect to inventory and due date performance.

Details

International Journal of Operations & Production Management, vol. 9 no. 7
Type: Research Article
ISSN: 0144-3577

Keywords

Article
Publication date: 1 June 1987

Timothy D. Fry, Patrick R. Philipoom, G. Keong Leong and Allen E. Smith

In this paper, the authors investigate the effects bottleneck machines have on the performance of a multi‐stage job shop. The operation performed by the bottleneck and its…

Abstract

In this paper, the authors investigate the effects bottleneck machines have on the performance of a multi‐stage job shop. The operation performed by the bottleneck and its position in the product Bill of Materials is varied to determine the effects on system performance. It was found that the best place for the bottleneck machine to be located was at gateway operations located low in the Bill of Materials.

Details

International Journal of Operations & Production Management, vol. 7 no. 6
Type: Research Article
ISSN: 0144-3577

Keywords

Book part
Publication date: 3 February 2015

Sean Yarborough and Patrick T. Hester

A discussion of call center agent work selection preferences is presented in the context of what is referred to herein as the accept–avoid decision. In call centers where agents…

Abstract

A discussion of call center agent work selection preferences is presented in the context of what is referred to herein as the accept–avoid decision. In call centers where agents are given autonomy to select calls from a shared queue for work without a standard routing mechanism, it is likely that each agent uses a different set of criteria and has different preferences which influence their decision to accept a call or avoid it. In order to understand such preferences, simple heuristics are developed and implemented into an additive linear model as an example to estimate the derived utility an agent may receive from the decision to accept a call. The game theoretic implications of such decision making by a group or team of agents are also discussed to illustrate the dilemma of the universally avoided call, and how agents may compete for acceptance or avoidance of particular calls.

Details

Applications of Management Science
Type: Book
ISBN: 978-1-78441-211-1

Keywords

1 – 3 of 3